Robust intersample crossing of target sets with mixed‐integer linear programming
نویسندگان
چکیده
منابع مشابه
Optimal Crossing Minimization using Integer Linear Programming
Acknowledgments First of all I want to thank my advisor Petra Mutzel and her group at the department of Algorithms and Data Structures at the Technical University of Vienna for the possibility to write my thesis about this interesting topic and for the outstanding support during the last years. Her great experience and expert knowledge in the field of Graph Drawing was a great help and her enth...
متن کاملFirst step immersion in interval linear programming with linear dependencies
We consider a linear programming problem in a general form and suppose that all coefficients may vary in some prescribed intervals. Contrary to classical models, where parameters can attain any value from the interval domains independently, we study problems with linear dependencies between the parameters. We present a class of problems that are easily solved by reduction to the classi...
متن کاملSOLVING FUZZY LINEAR PROGRAMMING PROBLEMS WITH LINEAR MEMBERSHIP FUNCTIONS-REVISITED
Recently, Gasimov and Yenilmez proposed an approach for solving two kinds of fuzzy linear programming (FLP) problems. Through the approach, each FLP problem is first defuzzified into an equivalent crisp problem which is non-linear and even non-convex. Then, the crisp problem is solved by the use of the modified subgradient method. In this paper we will have another look at the earlier defuzzifi...
متن کاملTo appear in Optimization Methods and Software ROBUST LINEAR PROGRAMMING DISCRIMINATION OF TWO LINEARLY INSEPARABLE SETS
A single linear programming formulation is proposed which generates a plane that minimizes an average sum of misclassi ed points belonging to two disjoint points sets in n-dimensional real space. When the convex hulls of the two sets are also disjoint, the plane completely separates the two sets. When the convex hulls intersect, our linear program, unlike all previously proposed linear programs...
متن کاملRobust solutions of Linear Programming problems contaminated with uncertain data
Optimal solutions of Linear Programming problems may become severely infeasible if the nominal data is slightly perturbed. We demonstrate this phenomenon by studying 90 LPs from the well-known NETLIB collection. We then apply the Robust Optimization methodology (Ben-Tal and Nemirovski [1-3]; El Ghaoui et al. [5,6]) to produce “robust” solutions of the above LPs which are in a sense immuned agai...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Robust and Nonlinear Control
سال: 2021
ISSN: 1049-8923,1099-1239
DOI: 10.1002/rnc.5373